Predicative Analysis of Feasibility and Diagonalization
نویسنده
چکیده
Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of Bellantoni and Cook, and Leivant. Here, we refine predicative analysis by using a ramified Ackermann’s con10 struction of a non-primitive recursive function. We obtain an hierarchy of functions which characterizes exactly functions, which are computed in O(n) over register machine model of computation. Then, we are able to diagonalize using dependent types in order to obtain an exponential function. 15
منابع مشابه
A Predicative Harmonization of the Time and Provable Hierarchies
A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(n) and TIMEF(nc); the finite Grzegorczyk classes at and above the elementary level, and the Σk-IND fragments of PA. Limited operators, diagonalization, and majorization functions are not used.
متن کاملTheory of Meaning in Commenting Predicative Qualities
The verses of predicative qualities have considered as a notable challenge of the ambiguous verses. Various views have been presented in the field of which the theories of real qualification and hermeneutics may be known as the most famous. Some have expanded the meaning to explain the predicative qualities; the fact of which two views occurred: one is 'putting words for the spirits of meanings...
متن کاملImplicit Computational Complexity and the Exponential Time-Space Classes
We extend the Implicit Computational Complexity program, promoted by Leivant and by other scholars, to all complexity classes DTIMESPACEF(f(n), g(n)), between DTIMEF(n) and DSPACEF(nn c ). Let clps(α, n) denote the result of replacing ω by n in Cantor normal form for α < ωω ω . A hierarchy T Sαβ is defined by means of a very restricted form of substitution, and of two un-limited operators (simu...
متن کاملPredicative Metaphors Are Understood as Two-Stage Categorization: Computational Evidence by Latent Semantic Analysis
In this paper, we address the problem of how people understand predicative metaphors such as “The rumor flew through the office”, and argue that two-stage categorization is the process via which predicative metaphors are understood. In the two-stage categorization process, the verb of a predicative metaphor (e.g., fly) evokes an intermediate category, which in turn evokes a metaphorical categor...
متن کاملA robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such spatiotemporal information into the analysis, and reduce the problem to the joint approximate diagonalization of a set of autocorrelation matrices. We demonstrate the feasibility of the algorithm by applying it to func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007